Team Orienteering Problem with Time Windows and Variable Profit
نویسندگان
چکیده
منابع مشابه
Solving multi-objective team orienteering problem with time windows using adjustment iterated local search
One of the problems tourism faces is how to make itineraries more effective and efficient. This research has solved the routing problem with the objective of maximizing the score and minimizing the time needed for the tourist’s itinerary. Maximizing the score means collecting a maximum of various kinds of score from each destination that is visited. The profits differ according to whether those...
متن کاملThe Multiconstraint Team Orienteering Problem with Multiple Time Windows
The Orienteering Problem (OP) is a combinatorial routing problem of which the goal is to find a tour that maximises the total score earned by visiting vertices. A set of vertices is given, determined by their coordinates and a score. The pairwise travel times between the vertices are known. The total travel time should not exceed a predetermined time budget. Each vertex can be visited at most o...
متن کاملAn ILS Algorithm for the Team Orienteering Problem with Variable Profit
The Orienteering Problem (OP) is a routing problem that has numerous applications in various fields such as logistics and tourism. The objective is to determine a subset of nodes to visit so that the total collected score is maximized and a given time budget is not exceeded. The extensive application of OP has led to many different variants, including the Team Orienteering Problem (TOP) and the...
متن کاملEfficient Heuristics for the Time Dependent Team Orienteering Problem with Time Windows
The Time Dependent Team Orienteering Problem with Time Windows (TDTOPTW) can be used to model several real life problems. Among them, the route planning problem for tourists interested in visiting multiple points of interest (POIs) using public transport. The main objective of this problem is to select POIs that match tourist preferences, while taking into account a multitude of parameters and ...
متن کاملIterated local search heuristic for the team orienteering problem with time windows
Tourists have the difficult task to schedule their holiday activities in such a way that they enjoy their holiday as much as possible, while keeping the opening times and exact locations of attractions in mind. This task can be formulated as the team orienteering problem with time windows (TOPTW). The TOPTW uses a list of locations as input, together with their opening times and appreciation sc...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computer Science and Information Systems (FedCSIS), 2019 Federated Conference on
سال: 2022
ISSN: ['2300-5963']
DOI: https://doi.org/10.15439/2022f158